<!DOCTYPE html>
<html lang="en">
<head>
  <meta charset="UTF-8" />
  <title>Real Use Cases &raquo; Standard Cell Placement | Taskflow QuickStart</title>
  <link rel="stylesheet" href="https://fonts.googleapis.com/css?family=Source+Sans+Pro:400,400i,600,600i%7CSource+Code+Pro:400,400i,600" />
  <link rel="stylesheet" href="m-dark+documentation.compiled.css" />
  <link rel="icon" href="favicon.ico" type="image/x-icon" />
  <meta name="viewport" content="width=device-width, initial-scale=1.0" />
  <meta name="theme-color" content="#22272e" />
</head>
<body>
<header><nav id="navigation">
  <div class="m-container">
    <div class="m-row">
      <span id="m-navbar-brand" class="m-col-t-8 m-col-m-none m-left-m">
        <a href="https://taskflow.github.io"><img src="taskflow_logo.png" alt="" />Taskflow</a> <span class="m-breadcrumb">|</span> <a href="index.html" class="m-thin">QuickStart</a>
      </span>
      <div class="m-col-t-4 m-hide-m m-text-right m-nopadr">
        <a href="#search" class="m-doc-search-icon" title="Search" onclick="return showSearch()"><svg style="height: 0.9rem;" viewBox="0 0 16 16">
          <path id="m-doc-search-icon-path" d="m6 0c-3.31 0-6 2.69-6 6 0 3.31 2.69 6 6 6 1.49 0 2.85-0.541 3.89-1.44-0.0164 0.338 0.147 0.759 0.5 1.15l3.22 3.79c0.552 0.614 1.45 0.665 2 0.115 0.55-0.55 0.499-1.45-0.115-2l-3.79-3.22c-0.392-0.353-0.812-0.515-1.15-0.5 0.895-1.05 1.44-2.41 1.44-3.89 0-3.31-2.69-6-6-6zm0 1.56a4.44 4.44 0 0 1 4.44 4.44 4.44 4.44 0 0 1-4.44 4.44 4.44 4.44 0 0 1-4.44-4.44 4.44 4.44 0 0 1 4.44-4.44z"/>
        </svg></a>
        <a id="m-navbar-show" href="#navigation" title="Show navigation"></a>
        <a id="m-navbar-hide" href="#" title="Hide navigation"></a>
      </div>
      <div id="m-navbar-collapse" class="m-col-t-12 m-show-m m-col-m-none m-right-m">
        <div class="m-row">
          <ol class="m-col-t-6 m-col-m-none">
            <li><a href="pages.html">Handbook</a></li>
            <li><a href="namespaces.html">Namespaces</a></li>
          </ol>
          <ol class="m-col-t-6 m-col-m-none" start="3">
            <li><a href="annotated.html">Classes</a></li>
            <li><a href="files.html">Files</a></li>
            <li class="m-show-m"><a href="#search" class="m-doc-search-icon" title="Search" onclick="return showSearch()"><svg style="height: 0.9rem;" viewBox="0 0 16 16">
              <use href="#m-doc-search-icon-path" />
            </svg></a></li>
          </ol>
        </div>
      </div>
    </div>
  </div>
</nav></header>
<main><article>
  <div class="m-container m-container-inflatable">
    <div class="m-row">
      <div class="m-col-l-10 m-push-l-1">
        <h1>
          <span class="m-breadcrumb"><a href="usecases.html">Real Use Cases</a> &raquo;</span>
          Standard Cell Placement
        </h1>
        <nav class="m-block m-default">
          <h3>Contents</h3>
          <ul>
            <li><a href="#UseCasesDreamPlace">DreamPlace: GPU-accelerated Placement Engine</a></li>
            <li><a href="#UseCasesDreamPlaceProgrammingEffort">Programming Effort</a></li>
            <li><a href="#UseCasesDreamPlacePerformance">Performance</a></li>
            <li><a href="#UseCasesDreamPlaceConclusion">Conclusion</a></li>
            <li><a href="#UseCasesDreamPlaceReferences">References</a></li>
          </ul>
        </nav>
<p>We applied Taskflow to solve a VLSI placement problem. The goal is to determine the physical locations of cells (logic gates) in a fixed layout region using minimal interconnect wirelength.</p><section id="UseCasesDreamPlace"><h2><a href="#UseCasesDreamPlace">DreamPlace: GPU-accelerated Placement Engine</a></h2><p>Placement is an important step in the layout generation stage of a circuit design. It places each cell of synthesized netlists in a region and optimizes their interconnect. The following figure shows a placement layout of an industrial design, adaptec1.</p><img class="m-image" src="dreamplace_1.png" alt="Image" /><p>Modern placement typically incorporates hundreds of millions of cells and takes several hours to finish. To reduce the long runtime, recent work started investigating new CPU-GPU algorithms. We consider matching-based hybrid CPU-GPU placement refinement algorithm developed by <a href="https://github.com/limbo018/DREAMPlace">DREAMPlace</a>. The algorithm iterates the following:</p><ul><li>A GPU-based maximal independent set algorithm to identify cell candidates</li><li>A CPU-based partition algorithm to cluster adjacent cells</li><li>A CPU-based bipartite matching algorithm to find the best permutation of cell locations.</li></ul><p>Each iteration contains overlapped CPU and GPU tasks with nested conditions to decide the convergence.</p><img class="m-image" src="dreamplace_2.png" alt="Image" /></section><section id="UseCasesDreamPlaceProgrammingEffort"><h2><a href="#UseCasesDreamPlaceProgrammingEffort">Programming Effort</a></h2><p>We implemented the hybrid CPU-GPU placement algorithm using Taskflow, <a href="https://github.com/oneapi-src/oneTBB">Intel TBB</a>, and <a href="http://starpu.gforge.inria.fr/">StarPU</a>. The algorithm is crafted on one GPU and many CPUs. Since TBB and StarPU have no support for nested conditions, we unroll their task graphs across fixed-length iterations found in hindsight. The figure below shows a partial taskflow of 4 cudaFlows, 1 conditioned cycle, and 12 static tasks for one placement iteration.</p><div class="m-graph"><svg style="width: 104.400rem; height: 67.100rem;" viewBox="0.00 0.00 1043.80 670.97">
<g transform="scale(1 1) rotate(0) translate(4 666.97)">
<title>Taskflow</title>
<g class="m-cluster">
<title>cluster_p0x55f824e16950</title>
<polygon points="394.14,-358 394.14,-537 642.48,-537 642.48,-358 394.14,-358"/>
<text text-anchor="middle" x="518.31" y="-523.5" font-family="Helvetica,sans-Serif" font-size="10.00">cudaFlow: h2d_constant</text>
</g>
<g class="m-cluster">
<title>cluster_p0x55f824e16ea0</title>
<polygon points="377.72,-125 377.72,-304 637.23,-304 637.23,-125 377.72,-125"/>
<text text-anchor="middle" x="507.48" y="-290.5" font-family="Helvetica,sans-Serif" font-size="10.00">cudaFlow: [0]mis_h2d</text>
</g>
<g class="m-cluster">
<title>cluster_p0x55f824e170c0</title>
<polygon points="8,-379 8,-504 346.58,-504 346.58,-379 8,-379"/>
<text text-anchor="middle" x="177.29" y="-490.5" font-family="Helvetica,sans-Serif" font-size="10.00">cudaFlow: [0]mis_loop_k</text>
</g>
<g class="m-cluster">
<title>cluster_p0x55f824e173f0</title>
<polygon points="534.5,-46 534.5,-117 793.02,-117 793.02,-46 534.5,-46"/>
<text text-anchor="middle" x="663.76" y="-103.5" font-family="Helvetica,sans-Serif" font-size="10.00">cudaFlow: [0]mis_loop_end</text>
</g>
<g class="m-node m-flat">
<title>p0x55f824e15da0</title>
<ellipse cx="442.67" cy="-617" rx="48.52" ry="18"/>
<text text-anchor="middle" x="442.67" y="-613.12" font-family="Helvetica,sans-Serif" font-size="10.00">new_net_mask</text>
</g>
<g class="m-node">
<title>p0x55f824e16950</title>
<polygon points="634.48,-497 631.48,-501 610.48,-501 607.48,-497 559.98,-497 559.98,-461 634.48,-461 634.48,-497"/>
<text text-anchor="middle" x="597.23" y="-475.12" font-family="Helvetica,sans-Serif" font-size="10.00">h2d_constant</text>
</g>
<g class="m-edge">
<title>p0x55f824e15da0&#45;&gt;p0x55f824e16950</title>
<path d="M477.96,-604.24C486.33,-600.33 494.97,-595.56 502.28,-590 533.2,-566.5 560.88,-531.17 578.05,-506.71"/>
<polygon points="580.89,-508.75 583.67,-498.52 575.13,-504.78 580.89,-508.75"/>
</g>
<g class="m-node m-flat">
<title>p0x55f824e16fb0</title>
<ellipse cx="741.4" cy="-423" rx="44.97" ry="18"/>
<text text-anchor="middle" x="741.4" y="-419.12" font-family="Helvetica,sans-Serif" font-size="10.00">mis_loop_beg</text>
</g>
<g class="m-edge">
<title>p0x55f824e16950&#45;&gt;p0x55f824e16fb0</title>
<path d="M634.84,-464.58C654,-457.03 677.57,-447.75 697.57,-439.87"/>
<polygon points="698.84,-443.13 706.86,-436.21 696.27,-436.62 698.84,-443.13"/>
</g>
<g class="m-node m-flat">
<title>p0x55f824e160d0</title>
<ellipse cx="442.67" cy="-563" rx="41.86" ry="18"/>
<text text-anchor="middle" x="442.67" y="-559.12" font-family="Helvetica,sans-Serif" font-size="10.00">new_pin2net</text>
</g>
<g class="m-edge">
<title>p0x55f824e160d0&#45;&gt;p0x55f824e16950</title>
<path d="M476.78,-552.05C485.26,-548.85 494.25,-545.1 502.28,-541 523.15,-530.37 545.06,-516.11 562.47,-503.95"/>
<polygon points="564.28,-506.96 570.41,-498.32 560.23,-501.25 564.28,-506.96"/>
</g>
<g class="m-node">
<title>p0x55f824e170c0</title>
<polygon points="338.58,-450 335.58,-454 314.58,-454 311.58,-450 261.83,-450 261.83,-414 338.58,-414 338.58,-450"/>
<text text-anchor="middle" x="300.2" y="-428.12" font-family="Helvetica,sans-Serif" font-size="10.00">[0]mis_loop_k</text>
</g>
<g class="m-edge">
<title>p0x55f824e16fb0&#45;&gt;p0x55f824e170c0</title>
<path d="M730.24,-440.89C715.75,-465.39 687.32,-509.89 655.18,-541 596.3,-597.98 580.64,-620.07 502.28,-644 449.34,-660.17 423.03,-675.81 377.72,-644 318.21,-602.21 304.78,-509.39 301.88,-461.64"/>
<polygon points="305.38,-461.59 301.41,-451.77 298.39,-461.92 305.38,-461.59"/>
</g>
<g class="m-node m-flat">
<title>p0x7f4ad8000e70</title>
<ellipse cx="442.67" cy="-438" rx="40.53" ry="18"/>
<text text-anchor="middle" x="442.67" y="-434.12" font-family="Helvetica,sans-Serif" font-size="10.00">h2d_pin2net</text>
</g>
<g class="m-edge">
<title>p0x7f4ad8000e70&#45;&gt;p0x55f824e16950</title>
<path d="M477.91,-447.2C498.82,-452.82 525.86,-460.09 548.82,-466.26"/>
<polygon points="547.68,-469.58 558.25,-468.79 549.5,-462.82 547.68,-469.58"/>
</g>
<g class="m-node m-flat">
<title>p0x7f4ad8000f30</title>
<ellipse cx="442.67" cy="-384" rx="37.42" ry="18"/>
<text text-anchor="middle" x="442.67" y="-380.12" font-family="Helvetica,sans-Serif" font-size="10.00">h2d_fv2pin</text>
</g>
<g class="m-edge">
<title>p0x7f4ad8000f30&#45;&gt;p0x55f824e16950</title>
<path d="M471.96,-395.69C481.77,-400.1 492.71,-405.4 502.28,-411 524.04,-423.72 546.98,-440.26 564.75,-453.84"/>
<polygon points="562.29,-456.36 572.34,-459.71 566.57,-450.83 562.29,-456.36"/>
</g>
<g class="m-node m-flat">
<title>p0x7f4ad8001140</title>
<ellipse cx="442.67" cy="-492" rx="35.65" ry="18"/>
<text text-anchor="middle" x="442.67" y="-488.12" font-family="Helvetica,sans-Serif" font-size="10.00">h2d_pin2v</text>
</g>
<g class="m-edge">
<title>p0x7f4ad8001140&#45;&gt;p0x55f824e16950</title>
<path d="M478.29,-489.05C498.95,-487.29 525.5,-485.03 548.17,-483.1"/>
<polygon points="548.45,-486.58 558.11,-482.25 547.85,-479.61 548.45,-486.58"/>
</g>
<g class="m-node m-flat">
<title>p0x55f824e16a60</title>
<ellipse cx="55.2" cy="-97" rx="45.86" ry="18"/>
<text text-anchor="middle" x="55.2" y="-93.12" font-family="Helvetica,sans-Serif" font-size="10.00">[0]shuffle_beg</text>
</g>
<g class="m-node m-flat">
<title>p0x55f824e16b70</title>
<ellipse cx="177.7" cy="-97" rx="39.64" ry="18"/>
<text text-anchor="middle" x="177.7" y="-93.12" font-family="Helvetica,sans-Serif" font-size="10.00">[0]shuffle_k</text>
</g>
<g class="m-edge">
<title>p0x55f824e16a60&#45;&gt;p0x55f824e16b70</title>
<path d="M101.41,-97C109.49,-97 117.96,-97 126.17,-97"/>
<polygon points="126.05,-100.5 136.05,-97 126.05,-93.5 126.05,-100.5"/>
</g>
<g class="m-node m-flat">
<title>p0x55f824e16c80</title>
<ellipse cx="300.2" cy="-97" rx="45.86" ry="18"/>
<text text-anchor="middle" x="300.2" y="-93.12" font-family="Helvetica,sans-Serif" font-size="10.00">[0]shuffle_end</text>
</g>
<g class="m-edge">
<title>p0x55f824e16b70&#45;&gt;p0x55f824e16c80</title>
<path d="M217.82,-97C225.76,-97 234.26,-97 242.66,-97"/>
<polygon points="242.48,-100.5 252.48,-97 242.48,-93.5 242.48,-100.5"/>
</g>
<g class="m-node m-flat">
<title>p0x55f824e16d90</title>
<ellipse cx="442.67" cy="-97" rx="59.17" ry="18"/>
<text text-anchor="middle" x="442.67" y="-93.12" font-family="Helvetica,sans-Serif" font-size="10.00">[0]mis_parallel_beg</text>
</g>
<g class="m-edge">
<title>p0x55f824e16c80&#45;&gt;p0x55f824e16d90</title>
<path d="M346.42,-97C354.56,-97 363.22,-97 371.87,-97"/>
<polygon points="371.67,-100.5 381.67,-97 371.67,-93.5 371.67,-100.5"/>
</g>
<g class="m-node">
<title>p0x55f824e16ea0</title>
<polygon points="629.23,-223 626.23,-227 605.23,-227 602.23,-223 565.23,-223 565.23,-187 629.23,-187 629.23,-223"/>
<text text-anchor="middle" x="597.23" y="-201.12" font-family="Helvetica,sans-Serif" font-size="10.00">[0]mis_h2d</text>
</g>
<g class="m-edge">
<title>p0x55f824e16d90&#45;&gt;p0x55f824e16ea0</title>
<path d="M482.44,-110.68C489.26,-113.69 496.13,-117.15 502.28,-121 528.18,-137.2 553.77,-160.72 571.69,-178.75"/>
<polygon points="568.81,-180.81 578.3,-185.52 573.82,-175.92 568.81,-180.81"/>
</g>
<g class="m-edge">
<title>p0x55f824e16ea0&#45;&gt;p0x55f824e16fb0</title>
<path d="M620.53,-223.22C638,-238.36 662,-261.21 678.43,-285 702.41,-319.72 720.7,-365.22 730.99,-394.29"/>
<polygon points="727.6,-395.19 734.17,-403.5 734.22,-392.91 727.6,-395.19"/>
</g>
<g class="m-node m-flat">
<title>p0x7f4ad8004530</title>
<ellipse cx="442.67" cy="-205" rx="56.95" ry="18"/>
<text text-anchor="middle" x="442.67" y="-201.12" font-family="Helvetica,sans-Serif" font-size="10.00">[0]h2d_ordered_vs</text>
</g>
<g class="m-edge">
<title>p0x7f4ad8004530&#45;&gt;p0x55f824e16ea0</title>
<path d="M500.04,-205C517.84,-205 537.18,-205 553.83,-205"/>
<polygon points="553.36,-208.5 563.36,-205 553.36,-201.5 553.36,-208.5"/>
</g>
<g class="m-node m-flat">
<title>p0x7f4ad8006d10</title>
<ellipse cx="442.67" cy="-151" rx="55.18" ry="18"/>
<text text-anchor="middle" x="442.67" y="-147.12" font-family="Helvetica,sans-Serif" font-size="10.00">[0]h2d_dependent</text>
</g>
<g class="m-edge">
<title>p0x7f4ad8006d10&#45;&gt;p0x55f824e16ea0</title>
<path d="M480.99,-164.21C503.13,-172.05 531.25,-182 554.17,-190.11"/>
<polygon points="552.93,-193.39 563.53,-193.42 555.27,-186.79 552.93,-193.39"/>
</g>
<g class="m-node m-flat">
<title>p0x7f4ad8006df0</title>
<ellipse cx="442.67" cy="-259" rx="50.29" ry="18"/>
<text text-anchor="middle" x="442.67" y="-255.12" font-family="Helvetica,sans-Serif" font-size="10.00">[0]h2d_selected</text>
</g>
<g class="m-edge">
<title>p0x7f4ad8006df0&#45;&gt;p0x55f824e16ea0</title>
<path d="M479.44,-246.34C501.79,-238.43 530.68,-228.2 554.14,-219.9"/>
<polygon points="555.14,-223.26 563.4,-216.62 552.8,-216.66 555.14,-223.26"/>
</g>
<g class="m-node m-flat">
<title>p0x55f824e171d0</title>
<ellipse cx="442.67" cy="-330" rx="59.61" ry="18"/>
<text text-anchor="middle" x="442.67" y="-326.12" font-family="Helvetica,sans-Serif" font-size="10.00">[0]mis_loop_update</text>
</g>
<g class="m-edge">
<title>p0x55f824e170c0&#45;&gt;p0x55f824e171d0</title>
<path d="M315.21,-413.65C329.34,-396.23 352.6,-370.35 377.72,-354 381.36,-351.63 385.27,-349.45 389.3,-347.44"/>
<polygon points="390.41,-350.78 398.08,-343.47 387.52,-344.4 390.41,-350.78"/>
</g>
<g class="m-node">
<title>p0x55f824e172e0</title>
<polygon points="597.23,-348 539.28,-330 597.23,-312 655.18,-330 597.23,-348"/>
<text text-anchor="middle" x="597.23" y="-326.12" font-family="Helvetica,sans-Serif" font-size="10.00">[0]mis_cond</text>
</g>
<g class="m-edge">
<title>p0x55f824e171d0&#45;&gt;p0x55f824e172e0</title>
<path d="M502.65,-330C510.37,-330 518.34,-330 526.22,-330"/>
<polygon points="526.14,-333.5 536.14,-330 526.14,-326.5 526.14,-333.5"/>
</g>
<g class="m-node m-flat">
<title>p0x7f4ad8007e00</title>
<ellipse cx="55.2" cy="-459" rx="39.2" ry="18"/>
<text text-anchor="middle" x="55.2" y="-455.12" font-family="Helvetica,sans-Serif" font-size="10.00">[0]h2d_size</text>
</g>
<g class="m-node">
<title>p0x7f4ad8007d00</title>
<polygon points="204.7,-477 154.7,-477 150.7,-473 150.7,-441 200.7,-441 204.7,-445 204.7,-477"/>
<polyline points="200.7,-473 150.7,-473"/>
<polyline points="200.7,-473 200.7,-441"/>
<polyline points="200.7,-473 204.7,-477"/>
<text text-anchor="middle" x="177.7" y="-455.12" font-family="Helvetica,sans-Serif" font-size="10.00" fill="white">[0]mis_k</text>
</g>
<g class="m-edge">
<title>p0x7f4ad8007e00&#45;&gt;p0x7f4ad8007d00</title>
<path d="M94.66,-459C108.86,-459 124.94,-459 139.07,-459"/>
<polygon points="138.89,-462.5 148.89,-459 138.89,-455.5 138.89,-462.5"/>
</g>
<g class="m-edge">
<title>p0x7f4ad8007d00&#45;&gt;p0x55f824e170c0</title>
<path d="M205.14,-453.07C218.41,-450.1 234.91,-446.4 250.37,-442.94"/>
<polygon points="250.92,-446.41 259.91,-440.8 249.39,-439.57 250.92,-446.41"/>
</g>
<g class="m-node m-flat">
<title>p0x7f4ad8007b80</title>
<ellipse cx="177.7" cy="-405" rx="39.2" ry="18"/>
<text text-anchor="middle" x="177.7" y="-401.12" font-family="Helvetica,sans-Serif" font-size="10.00">[0]d2h_size</text>
</g>
<g class="m-edge">
<title>p0x7f4ad8007b80&#45;&gt;p0x55f824e170c0</title>
<path d="M213.55,-412.81C225.05,-415.39 238.05,-418.3 250.39,-421.06"/>
<polygon points="249.48,-424.45 260,-423.22 251.01,-417.61 249.48,-424.45"/>
</g>
<g class="m-edge">
<title>p0x55f824e172e0&#45;&gt;p0x55f824e16fb0</title>
<path stroke-dasharray="5,2" d="M625.36,-339.62C635.06,-343.52 645.88,-348.43 655.18,-354 676.54,-366.79 698.31,-384.52 714.51,-398.81"/>
<polygon points="711.98,-401.25 721.76,-405.32 716.66,-396.04 711.98,-401.25"/>
<text text-anchor="middle" x="675.8" y="-369.75" font-family="Helvetica,sans-Serif" font-size="10.00">0</text>
</g>
<g class="m-node">
<title>p0x55f824e173f0</title>
<polygon points="785.02,-90 782.02,-94 761.02,-94 758.02,-90 697.77,-90 697.77,-54 785.02,-54 785.02,-90"/>
<text text-anchor="middle" x="741.4" y="-68.12" font-family="Helvetica,sans-Serif" font-size="10.00">[0]mis_loop_end</text>
</g>
<g class="m-edge">
<title>p0x55f824e172e0&#45;&gt;p0x55f824e173f0</title>
<path stroke-dasharray="5,2" d="M631.78,-322.4C640.29,-319.14 648.8,-314.52 655.18,-308 712.04,-249.86 731.29,-151.02 737.54,-101.75"/>
<polygon points="741.02,-102.19 738.69,-91.85 734.06,-101.38 741.02,-102.19"/>
<text text-anchor="middle" x="675.8" y="-283.75" font-family="Helvetica,sans-Serif" font-size="10.00">1</text>
</g>
<g class="m-node m-flat">
<title>p0x55f824e1aa20</title>
<ellipse cx="857.68" cy="-72" rx="34.32" ry="18"/>
<text text-anchor="middle" x="857.68" y="-68.12" font-family="Helvetica,sans-Serif" font-size="10.00">[0]hpwl_k</text>
</g>
<g class="m-edge">
<title>p0x55f824e173f0&#45;&gt;p0x55f824e1aa20</title>
<path d="M785.28,-72C794,-72 803.19,-72 811.97,-72"/>
<polygon points="811.69,-75.5 821.69,-72 811.69,-68.5 811.69,-75.5"/>
</g>
<g class="m-node m-flat">
<title>p0x55f824e1ab30</title>
<ellipse cx="982.4" cy="-126" rx="45.41" ry="18"/>
<text text-anchor="middle" x="982.4" y="-122.12" font-family="Helvetica,sans-Serif" font-size="10.00">del_net_mask</text>
</g>
<g class="m-edge">
<title>p0x55f824e1aa20&#45;&gt;p0x55f824e1ab30</title>
<path d="M884.71,-83.45C900.94,-90.59 922.18,-99.94 940.62,-108.05"/>
<polygon points="939.14,-111.23 949.7,-112.05 941.96,-104.82 939.14,-111.23"/>
</g>
<g class="m-node m-flat">
<title>p0x55f824e1ac40</title>
<ellipse cx="982.4" cy="-72" rx="40.53" ry="18"/>
<text text-anchor="middle" x="982.4" y="-68.12" font-family="Helvetica,sans-Serif" font-size="10.00">del_fnet2pin</text>
</g>
<g class="m-edge">
<title>p0x55f824e1aa20&#45;&gt;p0x55f824e1ac40</title>
<path d="M892.22,-72C904.07,-72 917.69,-72 930.65,-72"/>
<polygon points="930.3,-75.5 940.3,-72 930.3,-68.5 930.3,-75.5"/>
</g>
<g class="m-node m-flat">
<title>p0x55f824e1ad50</title>
<ellipse cx="982.4" cy="-18" rx="53.4" ry="18"/>
<text text-anchor="middle" x="982.4" y="-14.12" font-family="Helvetica,sans-Serif" font-size="10.00">del_fnet2pin_ofst</text>
</g>
<g class="m-edge">
<title>p0x55f824e1aa20&#45;&gt;p0x55f824e1ad50</title>
<path d="M884.71,-60.55C900.28,-53.7 920.46,-44.82 938.35,-36.94"/>
<polygon points="939.72,-40.17 947.46,-32.93 936.9,-33.76 939.72,-40.17"/>
</g>
<g class="m-node m-flat">
<title>p0x7f4ad8008470</title>
<ellipse cx="597.23" cy="-72" rx="54.73" ry="18"/>
<text text-anchor="middle" x="597.23" y="-68.12" font-family="Helvetica,sans-Serif" font-size="10.00">p0x7f4ad8008470</text>
</g>
<g class="m-edge">
<title>p0x7f4ad8008470&#45;&gt;p0x55f824e173f0</title>
<path d="M652.38,-72C663.45,-72 675.1,-72 686.16,-72"/>
<polygon points="685.93,-75.5 695.93,-72 685.93,-68.5 685.93,-75.5"/>
</g>
</g>
</svg>
</div><p>The table below lists the programming effort of each method, measured by <a href="https://dwheeler.com/sloccount/">SLOCCount</a>. Taskflow outperforms TBB and StarPU in all aspects. The whole program is about 1.5x and 1.7x less complex than that of TBB and StarPU, respectively.</p><table class="m-table"><thead><tr><th>Method</th><th>Lines of Code</th><th>Number of Tokens</th><th>Cyclomatic Complexity</th><th>Cost</th></tr></thead><tbody><tr><td>Taskflow</td><td>677</td><td>4180</td><td>53</td><td>$15,054</td></tr><tr><td>TBB</td><td>1000</td><td>6415</td><td>78</td><td>$21,736</td></tr><tr><td>StarPU</td><td>1279</td><td>8136</td><td>90</td><td>$29,686</td></tr></tbody></table></section><section id="UseCasesDreamPlacePerformance"><h2><a href="#UseCasesDreamPlacePerformance">Performance</a></h2><p>Using 8 CPUs and 1 GPU, Taskflow is consistently faster than others across all problem sizes (placement iterations). The gap becomes clear at large problem size; at 100 iterations, Taskflow is 17% faster than TBB and StarPU. We observed similar results using other CPU numbers. Performance saturates at about 16 CPUs, primarily due to the inherent irregularity of the placement algorithm.</p><img class="m-image" src="dreamplace_4.png" alt="Image" /><p>The memory footprint shows the benefit of our conditional tasking. We keep nearly no growth of memory when the problem size increases, whereas StarPU and TBB grow linearly due to unrolled task graphs. At a vertical scale, increasing the number of CPUs bumps up the memory usage of all methods, but the growth rate of Taskflow is much slower than the others.</p><img class="m-image" src="dreamplace_5.png" alt="Image" /><p>In terms of energy, our scheduler is very power efficient in completing the placement workload, regardless of problem sizes and CPU numbers. Beyond 16 CPUs where performance saturates, our system does not suffer from increasing power as StarPU, due to our adaptive task scheduling algorithm.</p><img class="m-image" src="dreamplace_6.png" alt="Image" /><p>For irregular task graphs akin to this placement workload, resource utilization is critical to the system throughput. We corun the same program by up to nine processes that compete for 40 CPUs and 1 GPU. Corunning a placement program is very common for searching the best parameters for an algorithm. We plot the throughput using <em>weighted speed-up</em> across nine coruns at two problem sizes. Both Taskflow and TBB achieve higher throughput than StarPU. At the largest problem size, Taskflow outperforms TBB and StarPU across all coruns.</p><img class="m-image" src="dreamplace_7.png" alt="Image" /></section><section id="UseCasesDreamPlaceConclusion"><h2><a href="#UseCasesDreamPlaceConclusion">Conclusion</a></h2><p>We have observed two significant benefits of Taskflow over existing programming systems. The first benefit is our conditional tasking. Condition tasks encode control-flow decisions directly in a cyclic task graph rather than unrolling it statically across iterations, saving a lot of memory usage. The second benefit is our runtime scheduler. Our scheduler is able to adapt the number of worker threads to available task parallelism at any time during the graph execution, providing improved performance, power efficiency, and system throughput.</p></section><section id="UseCasesDreamPlaceReferences"><h2><a href="#UseCasesDreamPlaceReferences">References</a></h2><ul><li>Yibo Lin, Wuxi Li, Jiaqi Gu, Haoxing Ren, Brucek Khailany and David Z. Pan, &quot;<a href="https://ieeexplore.ieee.org/document/8982049">ABCDPlace: Accelerated Batch-based Concurrent Detailed Placement on Multi-threaded CPUs and GPUs</a>,&quot; <em>IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems (TCAD)</em>, vol. 39, no. 12, pp. 5083-5096, Dec. 2020</li><li>Yibo Lin, Shounak Dhar, Wuxi Li, Haoxing Ren, Brucek Khailany and David Z. Pan, &quot;<a href="lin_19_01.pdf">DREAMPlace: Deep Learning Toolkit-Enabled GPU Acceleration for Modern VLSI Placement</a>&quot;, <em>ACM/IEEE Design Automation Conference (DAC)</em>, Las Vegas, NV, Jun 2-6, 2019</li></ul></section>
      </div>
    </div>
  </div>
</article></main>
<div class="m-doc-search" id="search">
  <a href="#!" onclick="return hideSearch()"></a>
  <div class="m-container">
    <div class="m-row">
      <div class="m-col-m-8 m-push-m-2">
        <div class="m-doc-search-header m-text m-small">
          <div><span class="m-label m-default">Tab</span> / <span class="m-label m-default">T</span> to search, <span class="m-label m-default">Esc</span> to close</div>
          <div id="search-symbolcount">&hellip;</div>
        </div>
        <div class="m-doc-search-content">
          <form>
            <input type="search" name="q" id="search-input" placeholder="Loading &hellip;" disabled="disabled" autofocus="autofocus" autocomplete="off" spellcheck="false" />
          </form>
          <noscript class="m-text m-danger m-text-center">Unlike everything else in the docs, the search functionality <em>requires</em> JavaScript.</noscript>
          <div id="search-help" class="m-text m-dim m-text-center">
            <p class="m-noindent">Search for symbols, directories, files, pages or
            modules. You can omit any prefix from the symbol or file path; adding a
            <code>:</code> or <code>/</code> suffix lists all members of given symbol or
            directory.</p>
            <p class="m-noindent">Use <span class="m-label m-dim">&darr;</span>
            / <span class="m-label m-dim">&uarr;</span> to navigate through the list,
            <span class="m-label m-dim">Enter</span> to go.
            <span class="m-label m-dim">Tab</span> autocompletes common prefix, you can
            copy a link to the result using <span class="m-label m-dim">⌘</span>
            <span class="m-label m-dim">L</span> while <span class="m-label m-dim">⌘</span>
            <span class="m-label m-dim">M</span> produces a Markdown link.</p>
          </div>
          <div id="search-notfound" class="m-text m-warning m-text-center">Sorry, nothing was found.</div>
          <ul id="search-results"></ul>
        </div>
      </div>
    </div>
  </div>
</div>
<script src="search-v2.js"></script>
<script src="searchdata-v2.js" async="async"></script>
<footer><nav>
  <div class="m-container">
    <div class="m-row">
      <div class="m-col-l-10 m-push-l-1">
        <p>Taskflow handbook is part of the <a href="https://taskflow.github.io">Taskflow project</a>, copyright © <a href="https://tsung-wei-huang.github.io/">Dr. Tsung-Wei Huang</a>, 2018&ndash;2024.<br />Generated by <a href="https://doxygen.org/">Doxygen</a> 1.9.6 and <a href="https://mcss.mosra.cz/">m.css</a>.</p>
      </div>
    </div>
  </div>
</nav></footer>
</body>
</html>
